Enumeration of unrooted odd-valent regular planar maps

نویسندگان

  • Zhicheng Gao
  • Valery A. Liskovets
  • Nicholas Wormald
چکیده

We derive closed formulae for the numbers of rooted maps with a fixed number of vertices of the same odd degree except for the root vertex and one other exceptional vertex of degree 1. The same applies to the generating functions for these numbers. Similar results, but without the vertex of degree 1, were obtained by the first author and Rahman. We also show, by manipulating a recursion of Bouttier, Di Francesco and Guitter, that there are closed formulae when the exceptional vertex has arbitrary degree. We combine these formulae with results of the second author to count unrooted regular maps of odd degree. In this way we obtain, for each even n, a closed ∗Supported by University of Macau and NSERC. †Supported by the Belarusian RFFR (grant No. F05-227). ‡Supported by the Canada Research Chairs program, NSERC and the University of Macau.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enumeration of eulerian and unicursal planar maps

Sum-free enumerative formulae are derived for several classes of rooted planar maps with no vertices of odd valency (eulerian maps) and with two vertices of odd valency (unicursal maps). As corollaries we obtain simple formulae for the numbers of unrooted eulerian and unicursal planar maps. Also, we obtain a sum-free formula for the number of rooted bi-eulerian (eulerian and bipartite) maps and...

متن کامل

Spanning forests in regular planar maps (conference version)

We address the enumeration of p-valent planar maps equipped with a spanning forest, with a weight z per face and a weight u per component of the forest. Equivalently, we count regular maps equipped with a spanning tree, with a weight z per face and a weight μ := u+ 1 per internally active edge, in the sense of Tutte. This enumeration problem corresponds to the limit q → 0 of the q-state Potts m...

متن کامل

Spanning forests in regular planar maps

We address the enumeration of p-valent planar maps equipped with a spanning forest, with a weight z per face and a weight u per connected component of the forest. Equivalently, we count p-valent maps equipped with a spanning tree, with a weight z per face and a weight μ := u + 1 per internally active edge, in the sense of Tutte; or the (dual) p-angulations equipped with a recurrent sandpile con...

متن کامل

Enumerative Formulae for Unrooted Planar Maps: a Pattern

We present uniformly available simple enumerative formulae for unrooted planar n-edge maps (counted up to orientation-preserving isomorphism) of numerous classes including arbitrary, loopless, non-separable, eulerian maps and plane trees. All the formulae conform to a certain pattern with respect to the terms of the sum over t | n, t < n. Namely, these terms, which correspond to non-trivial aut...

متن کامل

Enumeration of self-dual planar maps

A planar map is an embedding of a connected planar graph in the sphere such that the surface is partitioned into simply connected regions; in other words, it is a finite cellular decomposition of the sphere into vertices, edges, and faces (0−, 1− and 2−cells, respectively). In particular, 3−connected planar maps correspond to polyhedra. Motivated by the Four Colour Problem, W. Tutte [4] launche...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005